Applying autonomous hybrid agent-based computing to difficult optimization problems

نویسندگان

چکیده

Evolutionary multi-agent systems (EMASs) are very good at dealing with difficult, multi-dimensional problems, their efficacy was proven theoretically based on analysis of the relevant Markov-Chain model. Now research continues introducing autonomous hybridization into EMAS. This paper focuses a proposed hybrid version EMAS, and covers selection introduction number operators defining rules for starting steps main algorithm. Those leverage existing, well-known to be efficient metaheuristics, integrate results The discussed modifications evaluated difficult continuous-optimization benchmarks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Partial Solutions to Difficult AI Problems

Is finding just a part of a solution easier than finding the full solution? For NP-Complete problems (which represent some of the hardest problems for AI to solve) it has been shown that finding a fraction of the bits in a satisfying assignment is as hard as finding the full solution. In this paper we look at a possibility of both computing and representing partial solutions to NP-complete prob...

متن کامل

Applying Evolutionary Algorithms to Combinatorial Optimization Problems

The paper describes the comparison of three evolutionary algorithms for solving combinatorial optimization problems. In particular, a generational, a steady-state and a cellular genetic algorithm were applied to the maximum cut problem, the error correcting code design problem, and the minimum tardy task problem. The results obtained in this work are better than the ones previously reported in ...

متن کامل

Agent Based Decomposition of Optimization Problems

In this paper, we present an agent-based approach for solving an optimization problem using a Dantzig-Wolfe column generation scheme, i.e., a decomposition approach. It has been implemented and tested on an integrated production, inventory, and distribution routing problem. We developed a decomposition model for this optimization problem, which was implemented in the Java programming language, ...

متن کامل

Solutions Based on Particle Swarm Optimization for Optimal Control Problems of Hybrid Autonomous Switched Systems

—In this paper, a novel evolutionary computation technique, the Particle Swarm Optimisation (PSO) is applied to optimal control problems of hybrid autonomous switched systems. In particular, the developed algorithms amount to the computation of the optimal switching instants which are the optimization parameters. The objective is that to minimize a performance index, depending on these instants...

متن کامل

Ant Algorithms Solve Difficult Optimization Problems

The ant algorithms research field builds on the idea that the study of the behavior of ant colonies or other social insects is interesting for computer scientists, because it provides models of distributed organization that can be used as a source of inspiration for the design of optimization and distributed control algorithms. In this paper we overview this growing research field, giving parti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Science

سال: 2022

ISSN: ['1877-7511', '1877-7503']

DOI: https://doi.org/10.1016/j.jocs.2022.101858